Minimum degree and density of binary sequences
نویسندگان
چکیده
منابع مشابه
Minimum degree and density of binary sequences
3 For d, k ∈ N with k ≤ 2d, let g(d, k) denote the infimum density of binary 4 sequences (xi)i∈Z ∈ {0, 1}Z which satisfy the minimum degree condition d ∑ j=1 (xi+j + 5 xi−j) ≥ k for all i ∈ Z with xi = 1. We reduce the problem to determine g(d, k) 6 to a combinatorial problem related to the generalized k-girth of a graph G which 7 is defined as the minimum order of an induced subgraph of G of m...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملDensity Distributions in Random Binary Sequences Introduction: Frequency and Randomness
We start from the notion of the density of a word in a binary sequence. Given a xed binary word w of length n, let g(m; k) denote the number of distinct binary words v of length m containing just k occurences of w. An extended Central Limit Theorem can be applied to conclude that as m ! 1 so g(m; k) p 2 ?n m=2 m becomes approximately normal with mean 2 ?n m and variance s2 ?n m. We give a recur...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملDe Bruijn Sequences for the Binary Strings with Maximum Density
A de Bruijn sequence is a circular binary string of length 2n that contains each binary string of length n exactly once as a substring. A maximum-density de Bruijn sequence is a circular binary string of length ( n
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2010
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2010.01.005